The Polynomial Pivots as Initial Values for a New Root-Finding Iterative Method
نویسندگان
چکیده
منابع مشابه
New stopping criteria for iterative root finding
A set of simple stopping criteria is presented, which improve the efficiency of iterative root finding by terminating the iterations immediately when no further improvement of the roots is possible. The criteria use only the function evaluations already needed by the root finding procedure to which they are applied. The improved efficiency is achieved by formulating the stopping criteria in ter...
متن کاملThe Amended DSeSC Power Method for Polynomial Root-Finding
Cardinal’s matrix version of the Sebastiao e Silva polynomial root-finder rapidly approximates the roots as the eigenvalues of the associated Frobenius matrix. We preserve rapid convergence to the roots but amend the algorithm to allow input polynomials with multiple roots and root clusters. As in Cardinal’s algorithm, we repeatedly square the Frobenius matrix in nearly linear arithmetic time p...
متن کاملA New Iterative Method For Solving Fuzzy Integral Equations
In the present work, by applying known Bernstein polynomials and their advantageous properties, we establish an efficient iterative algorithm to approximate the numerical solution of fuzzy Fredholm integral equations of the second kind. The convergence of the proposed method is given and the numerical examples illustrate that the proposed iterative algorithm are valid.
متن کاملRoot-finding and Root-refining for a Polynomial Equation
Polynomial root-finders usually consist of two stages. At first a crude approximation to a root is slowly computed; then it is much faster refined by means of the same or distinct iteration. The efficiency of computing an initial approximation resists formal study, and the users rely on empirical data. In contrast, the efficiency of refinement is formally measured by the classical concept q whe...
متن کاملA New Iterative Method for Solving Initial Value Problems
In this paper, we introduce a new parameter iteration method (P-Iteration for short) ,which can be applied on Adams-Moulton methods to solve initial value problems. Compared with Jacobi iteration method, it has three advantages: (1) it may significantly implement the stable region of the iterative process such that we can efficiently use the large stable region of implicit formula; (2) it allow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2015
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2015/413816